Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube
نویسندگان
چکیده
In this paper, we introduce the hyper-star graph HS(n, k) as a new interconnection network, and discuss its properties such as faulttolerance, scalability, isomorphism, routing algorithm, and diameter. A hyper-star graph has merits when degree × diameter is used as a desirable quality measure of an interconnection network because it has a small degree and diameter. We also introduce a variation of HS(2k, k), folded hyper-star graphs FHS(2k,k) to further improve the cost degree × diameter of a hypercube: when FHS(2k, k) and an n-dimensional hypercube have the same number of nodes, degree × diameter of FHS(2k, k) is less than (k + 1)(dlogKe+ 1) whereas a hypercube is n, where K = ( 2k k ) . It shows that FHS(2k, k) is superior to a hypercube and its variations in terms of the cost, degree × diameter.
منابع مشابه
The spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملlgorithms of the Hyper - Star Graph and its Related Graphs
The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also bee...
متن کاملEmbedding Algorithms for Bubble-Sort, Macro-star, and Transposition Graphs
Bubble-sort, macro-star, and transposition graphs are interconnection networks with the advantages of star graphs in terms of improving the network cost of a hypercube. These graphs contain a star graph as their sub-graph, and have node symmetry, maximum fault tolerance, and recursive partition properties. This study proposes embedding methods for these graphs based on graph definitions, and sh...
متن کاملA Comparative Study on the Topological Properties of the Hyper-Mesh Interconnection Network
Recent ad*vances in parallel computing and the increasing need for massive parallelism resulted in the emergence of many attractive interconnection networks. Hypercube and mesh topologies have drawn considerable attention due to many of their attractive properties that are suited for parallel computing. However, both has certain major drawbacks that are affecting their over all performance. Thi...
متن کاملTree-Based Multicasting on Wormhole-Routed Star Graph Interconnection Networks with Hamiltonian Path
Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In our previous work on wormhole star graph networks routing, we proposed a path-base...
متن کامل